261 research outputs found

    A new microscopic nucleon-nucleon interaction derived from relativistic mean field theory

    Full text link
    A new microscopic nucleon-nucleon (NN) interaction has been derived for the first time from the popular relativistic mean field theory (RMFT) Lagrangian. The NN interaction so obtained remarkably relate to the inbuilt fundamental parameters of RMFT. Furthermore, by folding it with the RMFT-densities of cluster and daughter nuclei to obtain the optical potential, it's application is also examined to study the exotic cluster radioactive decays, and results obtained found comparable with the successfully used M3Y phenomenological effective NN interactions. The presently derived NN-interaction can also be used to calculate a number of other nuclear observables.Comment: 4 Pages 2 Figure

    Method for obtaining mycelial pads

    Get PDF
    Method for obtaining mycelial pad

    Spin-injection Hall effect in a planar photovoltaic cell

    Full text link
    Successful incorporation of the spin degree of freedom in semiconductor technology requires the development of a new paradigm allowing for a scalable, non-destructive electrical detection of the spin-polarization of injected charge carriers as they propagate along the semiconducting channel. In this paper we report the observation of a spin-injection Hall effect (SIHE) which exploits the quantum-relativistic nature of spin-charge transport and which meets all these key requirements on the spin detection. The two-dimensional electron-hole gas photo-voltaic cell we designed to observe the SIHE allows us to develop a quantitative microscopic theory of the phenomenon and to demonstrate its direct application in optoelectronics. We report an experimental realization of a non-magnetic spin-photovoltaic effect via the SIHE, rendering our device an electrical polarimeter which directly converts the degree of circular polarization of light to a voltage signal.Comment: 14 pages, 4 figure

    Hitting all Maximal Independent Sets of a Bipartite Graph

    Full text link
    We prove that given a bipartite graph G with vertex set V and an integer k, deciding whether there exists a subset of V of size k hitting all maximal independent sets of G is complete for the class Sigma_2^P.Comment: v3: minor chang

    Improving Strategies via SMT Solving

    Full text link
    We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widening operators for enforcing convergence within a finite number of iterations (ii) the use of merge operations (often, convex hulls) at the merge points of the control flow graph. It instead computes the least inductive invariant expressible in the domain at a restricted set of program points, and analyzes the rest of the code en bloc. We emphasize that we compute this inductive invariant precisely. For that we extend the strategy improvement algorithm of [Gawlitza and Seidl, 2007]. If we applied their method directly, we would have to solve an exponentially sized system of abstract semantic equations, resulting in memory exhaustion. Instead, we keep the system implicit and discover strategy improvements using SAT modulo real linear arithmetic (SMT). For evaluating strategies we use linear programming. Our algorithm has low polynomial space complexity and performs for contrived examples in the worst case exponentially many strategy improvement steps; this is unsurprising, since we show that the associated abstract reachability problem is Pi-p-2-complete

    Evaluating QBF Solvers: Quantifier Alternations Matter

    Full text link
    We present an experimental study of the effects of quantifier alternations on the evaluation of quantified Boolean formula (QBF) solvers. The number of quantifier alternations in a QBF in prenex conjunctive normal form (PCNF) is directly related to the theoretical hardness of the respective QBF satisfiability problem in the polynomial hierarchy. We show empirically that the performance of solvers based on different solving paradigms substantially varies depending on the numbers of alternations in PCNFs. In related theoretical work, quantifier alternations have become the focus of understanding the strengths and weaknesses of various QBF proof systems implemented in solvers. Our results motivate the development of methods to evaluate orthogonal solving paradigms by taking quantifier alternations into account. This is necessary to showcase the broad range of existing QBF solving paradigms for practical QBF applications. Moreover, we highlight the potential of combining different approaches and QBF proof systems in solvers.Comment: preprint of a paper to be published at CP 2018, LNCS, Springer, including appendi

    Sporting embodiment: sports studies and the (continuing) promise of phenomenology

    Get PDF
    Whilst in recent years sports studies have addressed the calls ‘to bring the body back in’ to theorisations of sport and physical activity, the ‘promise of phenomenology’ remains largely under-realised with regard to sporting embodiment. Relatively few accounts are grounded in the ‘flesh’ of the lived sporting body, and phenomenology offers a powerful framework for such analysis. A wide-ranging, multi-stranded, and interpretatively contested perspective, phenomenology in general has been taken up and utilised in very different ways within different disciplinary fields. The purpose of this article is to consider some selected phenomenological threads, key qualities of the phenomenological method, and the potential for existentialist phenomenology in particular to contribute fresh perspectives to the sociological study of embodiment in sport and exercise. It offers one way to convey the ‘essences’, corporeal immediacy and textured sensuosity of the lived sporting body. The use of Interpretative Phenomenological Analysis (IPA) is also critically addressed. Key words: phenomenology; existentialist phenomenology; interpretative phenomenological analysis (IPA); sporting embodiment; the lived-body; Merleau-Pont

    Geodesic rewriting systems and pregroups

    Full text link
    In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent and then systems in which the length reducing rules lead to geodesics. Combining these properties we arrive at our main object of study which we call geodesically perfect rewriting systems. We show that these are well-behaved and convenient to use, and give several examples of classes of groups for which they can be constructed from natural presentations. We describe a Knuth-Bendix completion process to construct such systems, show how they may be found with the help of Stallings' pregroups and conversely may be used to construct such pregroups.Comment: 44 pages, to appear in "Combinatorial and Geometric Group Theory, Dortmund and Carleton Conferences". Series: Trends in Mathematics. Bogopolski, O.; Bumagin, I.; Kharlampovich, O.; Ventura, E. (Eds.) 2009, Approx. 350 p., Hardcover. ISBN: 978-3-7643-9910-8 Birkhause
    corecore